#include<map>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#define N 100000
#define ull unsigned long long
using namespace std;
char cc;
bool tg;
inline int read(){
	int x = 0, f = 1; char c = getchar();
	while(c < '0' || c > '9'){if(c == '-')f = -1; c = getchar();}
	while(c >= '0' && c <= '9'){x = (x << 1) + (x << 3) + c - '0'; c = getchar();}
	return x * f;
}
int n, a[6];
ull x;
map<ull, int> mp;
char s[N], t[N];
int main(){
	freopen("network.in", "r", stdin);
//	freopen("network.out", "w", stdout);
	n = read();
	for(int i = 1; i <= n; ++i){
		scanf("%s%s", s + 1, t + 1);
		
	}
	return 0;
}
